GloptiPoly 3: moments, optimization and semidefinite programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GloptiPoly 3: moments, optimization and semidefinite programming

We describe a major update of our Matlab freeware GloptiPoly for parsing generalized problems of moments and solving them numerically with semidefinite programming. 1 What is GloptiPoly ? Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem of Moments (GPM), an infinite-dimensional optimization problem which can be viewed as an extension of the classical problem o...

متن کامل

Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds

We address the problem of evaluating the expected optimal objective value of a 0-1 optimization problem under uncertainty in the objective coefficients. The probabilistic model we consider prescribes limited marginal distribution information for the objective coefficients in the form of moments. We show that for a fairly general class of marginal information, a tight upper (lower) bound on the ...

متن کامل

Geometry, Moments, and Semidefinite Optimization

Optimization formulations seek to take advantage of structure and information in a particular problem, and investigate how successfully this information constrains the performance measures of interest. In this paper, we apply some recent results of algebraic geometry, to show how the underlying geometry of the problem may be incorporated in a natural way, in a semidefinite optimization formulat...

متن کامل

Semidefinite Programming and Combinatorial Optimization

We describe a few applications of semide nite programming in combinatorial optimization Mathematics Subject Classi cation C C C C C R

متن کامل

Semidefinite programming in combinatorial optimization

We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovfisz theta function and its applications to stable sets, perfect graphs, and coding theory. (it) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of finite metric spaces and its relatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Methods and Software

سال: 2009

ISSN: 1055-6788,1029-4937

DOI: 10.1080/10556780802699201